Difference between the Weighted H^|^infin;, H2-Optimal Solutions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between H2 optimal filters and unknown input observers – Performance limitations of H2 optimal filtering

This paper establishes a connection between the unknown input observer problem (also known as the exact input-decoupling filtering problem) and the Kalman filtering problem. Such a connection leads to a better understanding of filtering. As a consequence of this, tools for the analysis as well as synthesis of filters can be developed. Moreover, such tools can be utilized to establish performanc...

متن کامل

Weighted maximum matchings and optimal equi-difference conflict-avoiding codes

A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of Zn such that Δ(x) ∩ Δ(y) = ∅ for any x, y ∈ C and x = y, where Δ(x) = {a − b : a, b ∈ x, a = b}. Let CAC(n, k) denote the class of all CACs of length n and weight k. A CAC C ∈ CAC(n, k) is said to be equi-difference if any codeword x ∈ C has the form {0, i, 2i, . . . , (k − 1)i}. A CAC with maximum size is...

متن کامل

Interpolatory Weighted-H2 Model Reduction

This paper introduces an interpolation framework for the weighted-H2 model reduction problem. We obtain a new representation of the weighted-H2 norm of SISO systems that provides new interpolatory first order necessary conditions for an optimal reduced-order model. The H2 norm representation also provides an error expression that motivates a new weighted-H2 model reduction algorithm. Several nu...

متن کامل

On the difference between solutions of discrete tomography problems II

We consider the problem of reconstructing binary images from their horizontal and vertical projections. It is known that the projections do not necessarily determine the image uniquely. In a previous paper it was shown that the symmetric difference between two solutions (binary images that satisfy the projections) is at most 4α √ 2N . Here N is the sum of the projections in one direction (i.e. ...

متن کامل

On the difference between solutions of discrete tomography problems

We consider the problem of reconstructing binary images from their horizontal and vertical projections. We present a condition that the projections must necessarily satisfy when there exist two disjoint reconstructions from those projections. More generally, we derive an upper bound on the symmetric difference of two reconstructions from the same projections. We also consider two reconstruction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers

سال: 1992

ISSN: 0453-4654

DOI: 10.9746/sicetr1965.28.1138